On preconditioned Uzawa-type iterations for a saddle point problem with inequality constraints
نویسندگان
چکیده
We consider preconditioned Uzawa iterations for a saddle point problem with inequality constraints as arising from an implicit time discretization of the Cahn-Hilliard equation with obstacle potential. We present a new class of preconditioners based on linear Schur complements associated with successive approximations of the coincidence set. In numerical experiments, we found superlinear convergence and finite termination.
منابع مشابه
Nonsmooth Newton Methods for Set-Valued Saddle Point Problems
We present a new class of iterative schemes for large scale set– valued saddle point problems as arising, e.g., from optimization problems in the presence of linear and inequality constraints. Our algorithms can be either regarded as nonsmooth Newton–type methods for the nonlinear Schur complement or as Uzawa–type iterations with active set preconditioners. Numerical experiments with a control ...
متن کاملNonlinear Inexact Uzawa Algorithms for Linear and Nonlinear Saddle-point Problems
This paper proposes some nonlinear Uzawa methods for solving linear and nonlinear saddle-point problems. A nonlinear inexact Uzawa algorithm is first introduced for linear saddlepoint problems. Two different PCG techniques are allowed in the inner and outer iterations of the algorithm. This algorithm is then extended for a class of nonlinear saddle-point problems arising from some convex optimi...
متن کاملAn Inexact Uzawa-Type Iterative Method for Solving Saddle Point Problems
As an extension of the inexact Uzawa algorithm addressed in 1], we propose an improved inexact Uzawa-type iterative method for solving saddle point problems. The convergence rate is given in terms of the rates of the two basic iterations as deened in 1], and it is shown that the new algorithm always converges as long as the two basic iterations converge. A running title: Uzawa algorithm for sad...
متن کاملOn preconditioned Uzawa methods and SOR methods for saddle-point problems
This paper studies convergence analysis of a preconditioned inexact Uzawa method for nondi erentiable saddle-point problems. The SOR-Newton method and the SOR-BFGS method are special cases of this method. We relax the Bramble– Pasciak–Vassilev condition on preconditioners for convergence of the inexact Uzawa method for linear saddle-point problems. The relaxed condition is used to determine the...
متن کاملOptimization of the parameterized Uzawa preconditioners for saddle point matrices
The parameterized Uzawa preconditioners for saddle point problems are studied in this paper. The eigenvalues of the preconditioned matrix are located in (0, 2) by choosing the suitable parameters. Furthermore, we give two strategies to optimize the rate of convergence by finding the suitable values of parameters. Numerical computations show that the parameterized Uzawa preconditioners can lead ...
متن کامل